On automorphisms of distance-regular graph with intersection array {19, 16, 8; 1, 2, 8}

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Nonexistence of a Distance-Regular Graph with Intersection Array {22, 16, 5;1, 2, 20}

We prove that a distance-regular graph with intersection array {22, 16, 5; 1, 2, 20} does not exist. To prove this, we assume that such a graph exists and derive some combinatorial properties of its local graph. Then we construct a partial linear space from the local graph to display the contradiction.

متن کامل

A Distance-Regular Graph with Intersection Array (5, 4, 3, 3; 1, 1, 1, 2) Does Not Exist

We prove that a distance-regular graph with intersection array (5, 4, 3, 3; 1, 1, 1, 2) does not exist. The proof is purely combinatorial and computer-free.

متن کامل

Every 8-uniform 8-regular hypergraph is 2-colorable

As is well known, Lovfisz Local Lemma implies that every d-uniform d-regular hyper-graph is 2-colorable, provided d > 9. We present a different proof of a slightly stronger result; every d-uniform d-regular hypergraph is 2-colorable, provided d > 8.

متن کامل

A relationship between the diameter and the intersection number c 2 for a distance-regular graph

In this paper we will look at the relationship between the intersection number c2 and its diameter for a distance-regular graph. And also, we give some tools to show that a distance-regular graph with large c2 is bipartite, and a tool to show that if kD is too small then the distance-regular graph has to be antipodal.

متن کامل

A NOTE ON INCOMPLETE REGULAR TOURNAMENTS WITH HANDICAP TWO OF ORDER n ≡ 8 (mod 16)

A d-handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f : V → {1, 2, . . . , n} with the property that f(xi) = i and the sequence of weights w(x1), w(x2), . . . , w(xn) (where w(xi) = ∑ xixj ∈E f(xj)) forms an increasing arithmetic progression with common difference d. A graph G is a d-handicap distance antimagic graph if it allows a d-handicap distance a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Doklady Mathematics

سال: 2012

ISSN: 1064-5624,1531-8362

DOI: 10.1134/s1064562412050328